منابع مشابه
1231-1235 Turan LAJP 3348:Turan
Ismayil YILMAZ 1, Ismail DEMIRYILMAZ 2, Mehmet I. TURAN 3*, Bahadır SULEYMAN 4, Isil S. TURAN 5, Durdu ALTUNER 4, Hamit H. ALP 6 & Halis SULEYMAN 4 1 Erzincan University, Faculty of Medicine, Department of Surgery, Erzincan, Turkey 2 Ibni Sina Hospital, Department of General Surgery, Kayseri, Turkey 3 Diyarbakir Research and Educational Hospital, Department of Pediatric Neurology, Diyarbakir, T...
متن کاملUygulama Yaşam Döngüsü Yönetimi Karşılaştırmalı Süreç İncelemesi
Application Lifecycle Management (ALM) has a history of research related to software development processes and productivity over the last 40 years. Recently software has penetrated into almost every industry, thus every company is a software company now. Parallel to the history of ALM process models, at first it was considered synonymous to waterfall. However with the questioning of the success...
متن کاملTuran Related Problems for Hypergraphs
For an /-uniform hypergraph 3and an integer n, the Turan number ex(n, F) for F on n vertices is denned to be the maximum size \Q\ of a hypergraph Q C [n] not containing a copy of F C2\ as a subhypergraph. For 1 = 1 and f = Kk , the complete graph on k vertices, these numbers were determined by P. Turan. However, for I > 2, and nearly any hypergraph F, the Turan problem of determining the number...
متن کاملOn a Two-Sided Turan Problem
Given positive integers n, k, t, with 2 ≤ k ≤ n, and t < 2, let m(n, k, t) be the minimum size of a family F of nonempty subsets of [n] such that every k-set in [n] contains at least t sets from F , and every (k − 1)-set in [n] contains at most t− 1 sets from F . Sloan et. al [11] determined m(n, 3, 2) and Füredi et. al [6] studied m(n, 4, t) for t = 2, 3. We consider m(n, 3, t) and m(n, 4, t) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ankara Üniversitesi SBF Dergisi
سال: 1995
ISSN: 0378-2921
DOI: 10.1501/sbfder_0000001862